Lagrange multipliers theorem and saddle point optimality criteria in mathematical programming
نویسندگان
چکیده
We prove a version of Lagrange multipliers theorem for nonsmooth functionals defined on normed spaces. Applying these results, we extend some results about saddle point optimality criteria in mathematical programming. © 2005 Elsevier Inc. All rights reserved.
منابع مشابه
Sufficient global optimality conditions for general mixed integer nonlinear programming problems
In this paper, some KKT type sufficient global optimality conditions for general mixed integer nonlinear programming problems with equality and inequality constraints (MINPP) are established. We achieve this by employing a Lagrange function for MINPP. In addition, verifiable sufficient global optimality conditions for general mixed integer quadratic programming problems are der...
متن کاملNew second-order optimality conditions in multiobjective optimization problems: Differentiable case
To get positive Lagrange multipliers associated with each of the objective function, Maeda [Constraint qualification in multiobjective optimization problems: Differentiable case, J. Optimization Theory Appl., 80, 483–500 (1994)], gave some special sets and derived some generalized regularity conditions for first-order Karush–Kuhn– Tucker (KKT)-type necessary conditions of multiobjective optimiz...
متن کاملSaddle Point Criteria and Duality in Multiobjective Programming via an Η-approximation Method
In this paper, Antczak’s -approximation approach is used to prove the equivalence between optima of multiobjective programming problems and the -saddle points of the associated -approximated vector optimisation problems. We introduce an -Lagrange function for a constructed -approximated vector optimisation problem and present some modified -saddle point results. Furthermore, we construct an -ap...
متن کاملSlopes of shadow prices and Lagrange multipliers
Manyeconomicmodels andoptimizationproblemsgenerate (endogenous) shadow prices—alias dual variables or Lagrange multipliers. Frequently the “slopes” of resulting price curves—that is, multiplier derivatives—are of great interest. These objects relate to the Jacobian of the optimality conditions. That particular matrix often has block structure. So, we derive explicit formulas for the inverse of ...
متن کاملLagrange multipliers for set - valued optimization problems associated with coderivatives ✩
In this paper we investigate a vector optimization problem (P) where objective and constraints are given by set-valued maps. We show that by mean of marginal functions and suitable scalarizing functions one can characterize certain solutions of (P) as solutions of a scalar optimization problem (SP) with single-valued objective and constraint functions. Then applying some classical or recent res...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006